Uniform Interpolation for ALC Revisited

نویسندگان

  • Zhe Wang
  • Kewen Wang
  • Rodney Topor
  • Jeff Z. Pan
  • Grigoris Antoniou
چکیده

The notion of uniform interpolation for description logic ALC has been introduced in [9]. In this paper, we reformulate the uniform interpolation for ALC from the angle of forgetting and show that it satisfies all desired properties of forgetting. Then we introduce an algorithm for computing the result of forgetting in concept descriptions. We present a detailed proof for the correctness of our algorithm using the Tableau for ALC . Our results have been used to compute forgetting for ALC knowledge bases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Interpolation for퓐퓛퓒 Revisited

The notion of uniform interpolation for description logic ALC has been introduced in [9]. In this paper, we reformulate the uniform interpolation for ALC from the angle of forgetting and show that it satisfies all desired properties of forgetting. Then we introduce an algorithm for computing the result of forgetting in concept descriptions. We present a detailed proof for the correctness of our...

متن کامل

Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference

We develop a clausal resolution-based approach for computing uniform interpolants of TBoxes formulated in the description logic ALC when such uniform interpolants exist. We also present an experimental evaluation of our approach and of its application to the logical difference problem for real-life ALC ontologies. Our results indicate that in many practical cases uniform interpolants exist and ...

متن کامل

Uniform Interpolation of ALC-Ontologies Using Fixpoints

We present a method to compute uniform interpolants with fixpoints for ontologies specified in the description logic ALC. The aim of uniform interpolation is to reformulate an ontology such that it only uses a specified set of symbols, while preserving consequences that involve these symbols. It is known that in ALC uniform interpolants cannot always be finitely represented. Our method computes...

متن کامل

Uniform Interpolation and Forgetting for ALC Ontologies with ABoxes

Uniform interpolation and the dual task of forgetting restrict the ontology to a specified subset of concept and role names. This makes them useful tools for ontology analysis, ontology evolution and information hiding. Most previous research focused on uniform interpolation of TBoxes. However, especially for applications in privacy and information hiding, it is essential that uniform interpola...

متن کامل

Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes

We present a method to compute uniform interpolants of ALC-ontologies with ABoxes. Uniform interpolants are restricted views of ontologies that only use a specified set of symbols, but share all entailments in that signature with the original ontology. This way, it allows to select or remove information from an ontology based on a signature, which has applications in privacy, ontology analysis ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009